On the Chromatic Number of 2-Dimensional Spheres
نویسندگان
چکیده
In 1976 Simmons conjectured that every coloring of a 2-dimensional sphere radius strictly greater than 1/2 in three colors has pair monochromatic points at distance 1 apart. We prove this conjecture.
منابع مشابه
The locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملThe locating chromatic number of the join of graphs
Let $f$ be a proper $k$-coloring of a connected graph $G$ and $Pi=(V_1,V_2,ldots,V_k)$ be an ordered partition of $V(G)$ into the resulting color classes. For a vertex $v$ of $G$, the color code of $v$ with respect to $Pi$ is defined to be the ordered $k$-tuple $c_{{}_Pi}(v)=(d(v,V_1),d(v,V_2),ldots,d(v,V_k))$, where $d(v,V_i)=min{d(v,x):~xin V_i}, 1leq ileq k$. If distinct...
متن کاملThe Adaptable Chromatic Number and the Chromatic Number
We prove that the adaptable chromatic number of a graph is at least asymptotic to the square root of the chromatic number. This is best possible. Consider a graph G where each edge of G is assigned a colour from {1, ..., k} (this is not necessarily a proper edge colouring). A k-adapted colouring is an assignment of colours from {1, ..., k} to the vertices of G such that there is no edge with th...
متن کاملOn the packing chromatic number of hypercubes
The packing chromatic number χρ(G) of a graph G is the smallest integer k needed to proper color the vertices of G in such a way that the distance in G between any two vertices having color i be at least i+1. Goddard et al. [8] found an upper bound for the packing chromatic number of hypercubes Qn. Moreover, they compute χρ(Qn) for n ≤ 5 leaving as an open problem the remaining cases. In this p...
متن کاملOn the chromatic number of set systems
An r l -system is an r-uniform hypergraph in which every set of l vertices lies in at most one edge. Let mk r l be the minimum number of edges in an r l -system that is not k-colorable. Using probabilistic techniques, we prove that ar l kr−1 ln k l/ l−1 ≤ mk r l ≤ br l kr−1 ln k l/ l−1 where br l is explicitly defined and ar l is sufficiently small. We also give a different argument proving (fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete and Computational Geometry
سال: 2023
ISSN: ['1432-0444', '0179-5376']
DOI: https://doi.org/10.1007/s00454-023-00483-3